COMPARISON BETWEEN SPECTRAL CHARACTERISTICS EVALUATED FROM STRONG MOTIONS AND MICROTREMORS AT STRONG-MOTION SITES IN YOKOHAMA
نویسندگان
چکیده
منابع مشابه
Dynamic Characteristics of Buildings Estimated from Strong Motion Records
Estimation of the dynamic characteristics of buildings is a key issue in seismic design technology. Since 1957, the Building Research Institute (BRI), Japan, has been operating a network to monitor strong motion in buildings. In this study, dynamic characteristics of 25 actual buildings in the BRI network were estimated by using strong motion records. Acceleration records from two sensors respe...
متن کاملNonlinearity at California Generic Soil Sites from Modeling Recent Strong-Motion Data
The average strongto weak-motion amplification ratios during the 1989 Loma Prieta and 1987 Whittier Narrows earthquakes in California are estimated by modeling strong ground motions at soil sites in the linear-response assumption and comparing the simulated and observed records. The linear amplification function, used to synthesize ground motions, is the generic transfer function developed for ...
متن کاملComparison of Strong-motion Spectra with Teleseismic
We studied strong-motion spectra observed for three Mw 7.8 to 8.0 earthquakes (the 1985 Michoacan, Mexico; 1985 Valparaiso, Chile; and 1983 Akita-Oki, Japan earthquakes). We determined the decay of spectral amplitude with distance from the station, considering different measures of distance from a finite fault. We compared strong-motion spectra (Fourier acceleration spectra) observed for these ...
متن کاملSimulation of Strong Ground Motions
The estimation of potential strong ground motions at short epicentral distances (J1 = 10 to 25 km) resulting from large earthquakes, M;;;; 6.5, generally requires extrapolation of a limited data set. The goal of this project has been to quantify the extrapolation through a simulation technique that relies heavily upon the more extensive data set from smaller magnitude earthquakes. The simulatio...
متن کاملStrong Alliances in Graphs
For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Doboku Gakkai Ronbunshu
سال: 2000
ISSN: 0289-7806,1882-7187
DOI: 10.2208/jscej.2000.640_193